Parallel Algorithm Design for Workstation Clusters
نویسندگان
چکیده
Clusters of workstations connected by local area networks are in common use in many organizations. The combined processing power of these clusters is rarely exploited owing to the lack of suitable parallel algorithms. The paper describes a parallel programming paradigm called supervisor–worker, suitable for the workstation environment, which can be used to speed up the execution of a large class of existing sequential programs. Simple formulae are developed to predict the speed-up of a parallel algorithm developed in this way. The predictions depend on two easily-determined parameters of the sequential program and the characteristic communication cost of the workstation cluster. Consequently, it is possible to estimate the benefits of the parallel program before proceeding with detailed implementation. As an example, the parallel version of a travelling salesman program is developed and the measured speed-up compared with the predicted speed-up.
منابع مشابه
A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملPFSLib - A Parallel File System for Workstation Clusters
In this paper, we dicuss the the design and implementation of the PFSLib library wich offers the functionality of Intel’s parallel file system PFS. It is intended to be used with parallel programming environments like PVM, P4, and NXLib on workstation clusters. We also present preliminary performance results of PFSLib in comparison to NFS.
متن کاملParallel Algorithm for Filamentation of High-Power Super-Short Laser Pulses
An efficient parallel algorithm is proposed for solving the filamentaion problem of high-power femtosecond lasers pulses in gases. It was demonstrated that the algorithm possesses the property of coarse-grained parallelism and has a good scale-up characteristics when used on workstation clusters.
متن کاملParallelization of an iterative placement algorithm using ParMod-C
This paper describes the parallelization of a deterministic iterative method for the placement of standard cell circuits in VLSI design. The programming environment is the implementation of the parallel programming language ParMod-C for workstation clusters. The essential steps for transforming the existing sequential program to a parallel program are shown. An emphasis is laid on the discussio...
متن کاملParallel Algorithms for Workstation Clusters
We investigate the potential of workstation clusters for use in high performance computation for some selected applications. Currently, the network speed found in most of the existing systems is quite low, but higher speed networks are already emerging in the market. We present four parallel algorithms that performed astonishingly well on a cluster of workstations connected by Ethernet. Three o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 21 شماره
صفحات -
تاریخ انتشار 1991